Semantically Guiding a First-Order Theorem Prover with a Soft Model
نویسندگان
چکیده
Various versions of our first-order logic theorem prover SCOTT have been developed over the past decade to employ the concept of semantic guidance for improving the underlying system OTTER by McCune (Slaney, Lusk, & McCune 1994; Hodgson & Slaney 2001; 2002). We introduce our latest attempt to speed up OTTER’s proof search, Softie. While the various SCOTTs consulted an ordinary constraint solver to gain information about the problem to be solved, Softie is implemented from scratch and uses a solver capable of handling soft constraints.
منابع مشابه
Semantically Constrained Condensed Detachment Is Incomplete Semantically Constrained Condensed Detachment Is Incomplete
In reporting on the theorem prover SCOTT (Slaney, SCOTT: A Semantically Guided Theorem Prover, Proc. IJCAI, 1993) we suggested semantic constraint as as an appropriate mechanism for guiding proof searches in propositional systems where the rule of inference is condensed detachment|a generalisation of Modus Ponens. Such constrained condensed detachment is closely analogous to semantic resolution...
متن کاملSCOTT: A Model-Guided Theorem Prover
SCOTT (Semantically Constrained Otter) is a resolution-based automatic theorem prover for first order logic. It is based on the high performance prover OTTER by W. McCune and also incorporates a model generator. This finds finite models which SCOTT is able to use in a variety of ways to direct its proof search. Clauses generated by the prover are in turn used as axioms of theories to be modelle...
متن کاملA Tableau Prover for Natural Logic and Language
Modeling the entailment relation over sentences is one of the generic problems of natural language understanding. In order to account for this problem, we design a theorem prover for Natural Logic, a logic whose terms resemble natural language expressions. The prover is based on an analytic tableau method and employs syntactically and semantically motivated schematic rules. Pairing the prover w...
متن کاملGuiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and maintaining models against the improvement in quality of guidance as investment in the semantic aspect of the reasoning is increased. Previous attempts to resolve this tradeoff have resulted either in poor selection of m...
متن کاملProving Theorems about Java and the JVM with ACL2
We describe a methodology for proving theorems mechanically about Java methods. The theorem prover used is the ACL2 system, an industrial-strength version of the Boyer-Moore theorem prover. An operational semantics for a substantial subset of the Java Virtual Machine (JVM) has been defined in ACL2. Theorems are proved about Java methods and classes by compiling them with javac and then proving ...
متن کامل